A Linear Metric Reconstruction by Complex Eigen-Decomposition
نویسندگان
چکیده
quadratic equation is eigen-decomposed to build a linear This paper proposes a linear algorithm for metric equation to compute the projective-to-Euclidean trans-reconstruction from projective reconstruction. Metric formation matrix. reconstruction problem is equivalent to estimating the projective transformation matrix that converts projective reconstruction to Euclidean reconstruction. We build 2 Background on Auto-Calibration a quadratic form from dual absolute conic projection equation with respect to the elements of the transformation matrix. The matrix of quadratic form of rank 2 is then eigen-decomposed to produce a linear estimate. The comparison of results of our linear algorithm to results of bundle adjustment, applied to sets of synthetic image data having Gaussian image noise, shows reasonable error ranges.
منابع مشابه
A Reconstruction Algorithm for Compressed Sensing Noise Signal ?
The novel theory of Compressed Sensing (CS) reduces the samples of compressible signal sharply by information sampling. In order to improve reconstruction accuracy of noise signal for CS, a Singular Value Decomposition (SVD) noise signal reconstruction algorithm is presented in this paper. This algorithm decomposes the random measurement matrix, modifies the diagonal matrix Eigen values by mean...
متن کاملA Review on Eigen Analysis of Power System Using Parallel Computing
In this paper, a new parallel procedure is proposed to accelerate the solution of linear systems required by iterative Eigen analysis methods. Now days Eigen analysis of power systems is frequently used to study the effect and tune the response of existing controllers, to guide the design of new controllers. Recent developments in the area lead to the necessity of studying larger power system m...
متن کاملSingular Value Decomposition (SVD) and Generalized Singular Value Decomposition (GSVD)
The singular value decomposition (SVD) is a generalization of the eigen-decomposition which can be used to analyze rectangular matrices (the eigen-decomposition is definedonly for squaredmatrices). By analogy with the eigen-decomposition, which decomposes a matrix into two simple matrices, the main idea of the SVD is to decompose a rectangular matrix into three simple matrices: Two orthogonal m...
متن کاملAlgebraic Solving of Complex Interval Linear Systems by Limiting Factors
In this work, we propose a simple method for obtaining the algebraic solution of a complex interval linear system where coefficient matrix is a complex matrix and the right-hand-side vector is a complex interval vector. We first use a complex interval version of the Doolittle decomposition method and then we restrict the Doolittle's solution, by complex limiting factors, to achieve a complex in...
متن کاملCompatible Complex Structures on Twistor Spaces
Let (M, g) be an oriented 4-dimensional Riemannian manifold (not necessarily compact). Due to the Hodge-star operator ⋆, we have a decomposition of the bivector bundle ∧2 TM = ∧+ ⊕ ∧− . Here ∧± is the eigen-subbundle for the eigenvalue ±1 of ⋆. The metric g on M induces a metric, denoted by < , >, on the bundle ∧2 TM . Let π : Z = S (∧+) −→ M be the sphere bundle; the fiber over a point m ∈ M p...
متن کامل